Domination by product measures
نویسندگان
چکیده
منابع مشابه
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating sets in graphs. The power domination number γP (G) of G is the minimum cardinality of a power dominating set. Dorfling and Henning [2] determined the power domination number of the Cartesian product of paths. I...
متن کاملCharacterization of Product Measures by Integrability Condition
Let (E ′, μ) be the real Gaussian space, where E ′ is the space of tempered distributions and μ be the standard Gaussian measure on E ′. In the recent papers [4, 7, 8], Asai, Kubo and Kuo (AKK for short) have shown that in order to construct the Gel’fand triple [E ]u ⊂ L2(E ′, μ) ⊂ [E ]u associated with a growth function u ∈ C+,1/2, essential conditions on u are (U0)(U2)(U3) stated in Section 2...
متن کاملInteger domination of Cartesian product graphs
Given a graph G, a dominating set D is a set of vertices such that any vertex not in D has at least one neighbor in D. A {k}-dominating multiset Dk is a multiset of vertices such that any vertex in G has at least k vertices from its closed neighborhood in Dk when counted with multiplicity. In this paper, we utilize the approach developed by Clark and Suen (2000) to prove a ‘‘Vizing-like’’ inequ...
متن کاملDomination In The Cross Product Of Digraphs
In many papers, the relation between the domination number of a product of graphs and the product of domination numbers of factors is studied. Here we investigate this problem for domination and total domination numbers in the cross product of digraphs. We give analogues of known results for graphs, and we also present new results for digraphs with sources. Using these results we find dominatio...
متن کاملTotal Domination Number of Cartesian Product Networks
Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1997
ISSN: 0091-1798
DOI: 10.1214/aop/1024404279